Dynamic Programming from an Excel Perspective
نویسندگان
چکیده
Many students have difficulty understanding the concept of dynamic programming, a problem solving approach appropriate to use when a problem can be broken down into overlapping sub-problems. In addition, computer science majors seldom take a course in which a spreadsheet application is taught or used, although spreadsheet applications can be a great tool in visualizing and solving problems. This paper attempts to address these issues by providing examples of problems that can be solved in a spreadsheet environment using dynamic programming in various computer science courses.
منابع مشابه
Capacity price decisions, a manufacturing yield management perspective
This paper focuses on formulating capacity-price trade off problem in Yield Management for manufactur-ing industry by drawing motivation from the remarkable success of Yield Management (YM) implementation in airlines. In the current practice, there is no alternative and procedure for the manufacturer, as well as cus-tomers to take advantage of using the unfulfilled capacity in discounted offers...
متن کاملAn Optimal Tax Relief Policy with Aligning Markov Chain and Dynamic Programming Approach
Abstract In this paper, Markov chain and dynamic programming were used to represent a suitable pattern for tax relief and tax evasion decrease based on tax earnings in Iran from 2005 to 2009. Results, by applying this model, showed that tax evasion were 6714 billion Rials**. With 4% relief to tax payers and by calculating present value of the received tax, it was reduced to 3108 billion Rials. ...
متن کاملEnergy cost minimization in an electric vehicle solar charging station via dynamic programming
Environmental crisis and shortage of fossil fuels make Electric Vehicles (EVs) alternatives for conventional vehicles. With growing numbers of EVs, the coordinated charging is necessary to prevent problems such as large peaks and power losses for grid and to minimize charging costs of EVs for EV owners. Therefore, this paper proposes an optimal charging schedule based on Dynamic Programming (DP...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملA Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains
Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013